Characterization of ex post equilibrium in the VCG combinatorial auctions

نویسندگان

  • Ron Holzman
  • Dov Monderer
چکیده

We prove that when the number of (potential) buyers is at least three, every ex post equilibrium in the Vickrey-Clarke-Groves combinatorial auction mechanisms is a bundling equilibrium and is symmetric. This complements a theorem proved in Holzman, Kfir-Dahav, Monderer, and Tennenholtz [6], according to which, the symmetric bundling equilibria are precisely those defined by a quasi field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ascending price Vickrey auctions for general valuations

Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax this definition by allowing discounts to buyers from the final price of the auction (or alternativel...

متن کامل

Bundling Equilibrium in Combinatorial auctions

This paper analyzes ex post equilibria in the VCG combinatorial auctions. If Σ is a family of bundles of goods, the organizer may restrict the bundles on which the participants submit bids, and the bundles allocated to them, to be in Σ . The Σ-VCG combinatorial auctions obtained in this way are known to be truth-telling mechanisms. In contrast, this paper deals with non-restricted VCG auctions,...

متن کامل

A Ex-Post Equilibrium and VCG Mechanisms

Consider an abstract social choice setting with incomplete information, where the number of alternatives is large. Albeit natural, implementing VCG mechanisms is infeasible due to the prohibitive communication constraints. However, if players restrict attention to a subset of the alternatives, feasibility may be recovered. This paper characterizes the class of subsets which induce an ex-post eq...

متن کامل

On the robustness of non-linear personalized price combinatorial auctions

Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auctions (ICAs). Several promising ICA formats were developed based on primal-dual and subgradient algorithms. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle(...

متن کامل

VCG-equivalent in expectation mechanism: general framework for constructing iterative combinatorial auction mechanisms

In this paper, we develop a new class of iterative mechanisms called a VCG-equivalent in expectation mechanism. Iterative auctions are preferred over their sealed-bid counterparts in practical settings, since they can avoid full revelation of type information. However, to guarantee that sincere strategies are an ex post equilibrium, the mechanism needs to achieve exactly the same outcome as the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2004